Weak Parity
نویسندگان
چکیده
We study the query complexity of WEAK PARITY: the problem of computing the parity of an n-bit input string, where one only has to succeed on a 1/2+ε fraction of input strings, but must do so with high probability on those inputs where one does succeed. It is well-known that n randomized queries and n/2 quantum queries are needed to compute parity on all inputs. But surprisingly, we give a randomized algorithm for WEAK PARITY that makes only O(n/ log(1/ε)) queries, as well as a quantum algorithm that makes O(n/ √ log(1/ε)) queries. We also prove a lower bound of Ω (n/ log (1/ε)) in both cases; and using extremal combinatorics, prove lower bounds of Ω(log n) in the randomized case and Ω( √ logn) in the quantum case for any ε > 0. We show that improving our lower bounds is intimately related to two longstanding open problems about Boolean functions: the Sensitivity Conjecture, and the relationships between query complexity and polynomial degree.
منابع مشابه
Linear Time Algorithm for Weak Parity Games
We consider games played on graphs with the winning conditions for the players specified as weak-parity conditions. In weak-parity conditions the winner of a play is decided by looking into the set of states appearing in the play, rather than the set of states appearing infinitely often in the play. A naive analysis of the classical algorithm for weak-parity games yields a quadratic time algori...
متن کاملParity Nonconservation in Polarized Electron
Parity violation has been well established in particle physics for many years, since the 1950's where it was first seen in beta decay processes. The strong and electromagnetic forces are parity conserving, and the experimental evidence that parity was not conserved in weak processes came somewhat as a surprise. The weak forces are responsible for the decay of radioactive nuclei, and it was in t...
متن کاملParity Violation in Polarized Electron Scattering
Parity violation has been well established in particle physics for many years, since the 1950's where it was. first seen in beta decay processes. The strong and electromagnetic forces are parity conserving, and the experimental evidence that parity was not conserved in weak processes came somewhat as a surprise. The weak forces are responsible for the decay of radioactive nuclei, and it was in ...
متن کاملQuestion of Parity Conservation in Weak Interactions
the r+(=E s+) mesons. On the other hand, analyses' of the decay products of r+ strongly suggest on the grounds of angular momentum and parity conservation that the ~+ and 8 are not the same particle. This poses a rather puzzling situation that has been extensively discussed. ' One way out of the difhculty is to assume that parity is not strictly conserved, so that 0+ and v-+ are two diGerent de...
متن کاملWeak Parity Games and Language Containment of Weak Alternating Parity Automata
Optimisations of the state space of weak alternating parity automata (WAPA) are needed for example to speed up μTL model-checking algorithms which involve WAPA. It is assumed that deciding language containment for WAPA is helpful to perform such optimisations. In this paper the problem of language containment is reduced to the problem of computing winning sets in weak parity games. For the latt...
متن کاملSelected Parity Violation Experiments
I start by reviewing existing ~ pp measurements with particular emphasis on the recent 221 MeV ~pp measurement at TRIUMF which permitted the weak meson-nucleon coupling constants h ρ and h pp ω to be determined separately for the first time. I then review ~np experiments, with specific details of the ~np → dγ experiment now under preparation at Los Alamos National Laboratory. This experiment wi...
متن کامل